Relating Semantic Models of Compensating CSP
نویسندگان
چکیده
Building equivalences between different semantic models of a language strengthens the formal foundation of the language. This paper shows the derivation of denotational semantics from operational semantics of the language cCSP. The aim is to show the correspondence between the operational and trace semantics. We extract traces from operational rules and use structural induction to show the correspondence between the two semantics of cCSP.
منابع مشابه
Formalizing cCSP Synchronous Semantics in PVS
Compensating CSP (cCSP) is a language defined to model long running business transactions within the framework of standard CSP process algebra. In earlier work, we have defined both traces and operational semantics of the language. We have shown the consistency between the two semantic models by defining a relationship between them. Synchronization was missing from the earlier semantic definiti...
متن کاملGeneral dynamic recovery for compensating CSP
Compensation is a technique to roll-back a system to a consistent state in case of failure. Recovery mechanisms for compensating calculi specify the order of execution of compensation sequences. Dynamic recovery means that the order of execution is determined at runtime. In this paper, we define an extension of Compensating CSP, called DEcCSP, with general dynamic recovery. We provide a formal,...
متن کاملExecutable Semantics for Compensating CSP
Compensation is an error recovery mechanism for long-running transactions. Compensating CSP is a variant of the CSP process algebra with constructs for orchestration of compensations. We present a simple operational semantics for Compensating CSP and outline an encoding of this semantics in Prolog. This provides a basis for implementation and model checking of the language.
متن کاملFailure-Divergence Refinement of Compensating Communicating Processes
Compensating CSP (cCSP) extends CSP for specification and verification of long running transactions. The original cCSP is a modest extension to a subset of CSP that does not consider non-deterministic choice, synchronized composition, and recursion. There are a few further extensions. However, it remains a challenge to develop a fixed-point theory of process refinement in cCSP. This paper provi...
متن کاملEvolving by Maximizing the Number of Rules: Complexity Study Mutual Mobile Membrane Systems with Surface Objects
In [20] we presented a semantic study of a language LJ that extends Hoares CSP model with communication on multiple channels and synchronization based on join patterns in the style of Join calculus. In this paper we consider a language L2 J that extends LJ with second order communication: sending and receiving of statements rather than values. We employ the mathematical methodology of metric se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006